Languages vs . ω - Languages in Regular Infinite
نویسندگان
چکیده
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes K of regular languages of finite words (called ∗-languages), using natural transformations of ∗-languages into ω-languages. Winning strategies for infinite games can be represented again in terms of ∗-languages. Continuing work of Selivanov (2007) and Rabinovich et al. (2007), we analyze how these “strategy ∗-languages” are related to the original language class K. In contrast to that work, we exhibit classes K where strategy representations strictly exceed K.
منابع مشابه
Deterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملLanguages vs. ω-Languages in Regular Infinite Games
Infinite games are studied in a format where two players, called Player 1 and Player 2, generate a play by building up an ω-word as they choose letters in turn. A game is specified by the ω-language which contains the plays won by Player 2. We analyze ω-languages generated from certain classes K of regular languages of finite words (called ∗-languages), using natural transformations of ∗-langua...
متن کاملToward a Structure Theory of Regular Infinitary Trace Languages
The family of regular languages of infinite words is structured into a hierarchy where each level is characterized by a class of deterministic ω-automata – the class of deterministic Büchi automata being the most prominent among them. In this paper, we analyze the situation of regular languages of infinite Mazurkiewicz traces that model non-terminating, concurrent behaviors of distributed syste...
متن کاملω-Semigroups and the Fine Classification of Borel Subsets of Finite Ranks of the Cantor Space
The algebraic study of formal languages draws the equivalence between ω-regular languages and subsets of finite ω-semigroups. The ω-regular languages being the ones characterised by second order monadic formulas. Within this framework, in [1]we provide a characterisation of the algebraic counterpart of the Wagner hierarchy: a celebrated hierarchy of ω-regular languages. For this, we adopt a hie...
متن کاملDeterministic finite H-Automata and ω-regular partial languages
Partial words, that is, finite words with holes, were introduced in the 70s by Fischer and Paterson, with respect to bioinformatics applications. Infinite partial words were introduced later. Recently, Dassow et al.’s connected partial words and regular languages. In this paper, we extend the local partial languages to local ω-partial languages and study their closure properties. We introduce t...
متن کامل